"Balls into Bins" - A Simple and Tight Analysis
نویسندگان
چکیده
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≥ n/polylog(n) by using the simple and well-known method of the first and second moment.
منابع مشابه
Non-Uniform Balls-into-Bins and the Analysis of Lock-Free Algorithms1
In this work, we consider the following random process, motivated by the analysis of lock-free con-current algorithms under stochastic schedulers. In each step, a new ball is allocated into one of n bins, according toa distribution p = (p1, p2, . . . ,pn), where each ball goes to bin i with probability pi. When some bin first reaches aset threshold of balls, it registers a win, ...
متن کاملMultiple-Choice Balanced Allocation in (Almost) Parallel
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches. We study this scenario in an abstract framework of allocating balls into bins. We revisit the allocation algorithm GREEDY[2] due to Azar, Broder, Karlin, and Upfal (SIAM J. Comput. 1999), in which, for sequentially arriving balls, each ball chooses two ...
متن کاملOn Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation
The view size estimation plays an important role in query optimization. It has been observed that many data follow a power law distribution. In this paper, we consider the balls in bins problem where we place balls into N bins when the bin selection probabilities follow a power law distribution. As a generalization to the coupon collector’s problem, we address the problem of determining the exp...
متن کاملFractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bipartite graph with n nodes on each side, we view each node on the left as having balls that it can throw into nodes on the right (bins) to which it is adjacent. If each node on the left throws exactly one ball and each ...
متن کاملSymmetric vs. Asymmetric Multiple-Choice Algorithms
Multiple-choice allocation algorithms have been studied intensively over the last decade. These algorithms have several applications in the areas of load balancing, routing, resource allocation and hashing. The underlying idea is simple and can be explained best in the balls-and-bins model: Instead of assigning balls (jobs, requests, or keys) simply at random to bins (machines, servers, or posi...
متن کامل